Listing All Minimal Separators of a Graph
نویسندگان
چکیده
An efficient algorithm listing all minimal vertex separators of an undirected graph is given. The algorithm needs polynomial time per separator that is found.
منابع مشابه
Listing all the minimal separators of a planar graph
I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) per separator.
متن کاملListing all the minimal separators of a 3-connected planar graph
We present an efficient algorithm that lists the minimal separators of a 3-connected planar graph in O(n) per separator.
متن کاملGenerating All the Minimal Separators of a Graph
We present an eecient algorithm which computes the set of minimal separators of a graph in O(n 3) time per separator, thus gaining a factor of n 2 on the current best-time algorithms for this problem. Our process is based on a new structural result, derived from Kloks and Kratsch's work on listing all the minimal separators of a graph.
متن کاملListing All Potential Maximal Cliques of a Graph
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum 5ll-in are polynomially tractable for these graphs. We show here that the potential maximal cliques of a graph can be generated in polynomial time i...
متن کاملSubmission Track B : exact algorithm for Minimum Fill - In ( aka Chordal Completion )
Our implementation follows the exact algorithm of Fomin et al. [3] which is based on listing the minimal separators, the potential maximal cliques, and then performing dynamic programming based on those structures [1, 2]. The algorithm by Fomin et al. refines the approach of Bouchitté and Todinca on some minor aspects (only considering inclusion-minimal minimal separators, trying only the so-ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 27 شماره
صفحات -
تاریخ انتشار 1998